Near-Optimal Hot-Potato Routing on Trees
نویسندگان
چکیده
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, which causes conflicting packets to be deflected away from their destinations. We study one-to-many batch routing problems on arbitrary tree topologies. We present two hot-potato routing algorithms, one deterministic and one randomized, whose routing times are asymptotically near-optimal (within poly-logarithmic factors from optimal). Both algorithms are distributed and greedy; so, routing decisions are made locally, and packets are advanced towards their destinations whenever possible.
منابع مشابه
Many-to-Many Routing on Trees via Matchings
In this paper we present an extensive study of many-to-many routing on trees under the matching routing model. Our study includes on-line and off-line algorithms. We present an asymptotically optimal on-line algorithm which routes k packets to their destination within d(k 1) + d f dist routing steps, where d is the degree of tree T on which the routing takes place and dist is the maximum distan...
متن کاملShortest-path and Hot-potato Routing on Unbuuered 2-d Tori
We probabilistically model dynamic routing on un-buuered 2-dimensional tori. We consider shortest-path routing with packet loss and retransmissions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node through-put, and average packet latency indicate that the proposed ALB strategy is a much bett...
متن کاملShortest-path and Hot-potato Routing on Unbuuered Toroidal Networks
We probabilistically model dynamic packet routing on unbuuered 2-D and 3-D toroidal networks. We consider shortest-path routing with packet loss and retrans-missions versus a newly proposed all-link busy (ALB) hot-potato routing strategy with packet deeections. Computations of the sustained packet generating rate, node throughput, and average packet latency indicate that the proposed ALB strate...
متن کاملEfficient bufferless packet switching on trees and leveled networks
In bufferless networks the packets cannot be buffered while they are in transit; thus, once injected, the packets have to move constantly. Bufferless networks are interesting because they model optical networks. We consider the tree and leveled network topologies, which represent a wide class of network configurations. On these networks, we study many-to-one batch problems where each node is th...
متن کاملDeterministic k Routing on Meshes With Applications to Worm Hole Routing
In k routing each of the n processing units of an n n mesh connected computer initially holds packet which must be routed such that any processor is the destination of at most k packets This problem re ects practical desire for routing better than the popular routing of permutations k routing also has implications for hot potato worm hole routing which is of great importance for real world syst...
متن کامل